Pressure laws and fast Legendre transform
نویسندگان
چکیده
In this paper we investigate algorithms based on the Fast Legendre Transform (FLT) in order to compute tabulated Equation Of State (EOS) for fluids with phase transition. The equation of state of a binary mixture is given by an energy minimization principle. According to the miscible or immiscible nature of the mixture, the energy of the system is either a convex envelope or an inf-convolution of the energies of the two phases. Because these operations are closely linked to Legendre Transform, it is possible to construct O(N) algorithms that compute efficiently these operations, where N is the number of points in the table. In addition, it appears that the natural mathematical tool for studying mixture thermodynamics in the Legendre space is the max-plus algebra theory.
منابع مشابه
A Fast, Simple, and Stable Chebyshev-Legendre Transform Using an Asymptotic Formula
A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coefficients of a degree N polynomial in O(N(logN)2/ log logN) operations is derived. The basis of the algorithm is to rewrite a well-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the di...
متن کاملLegendre Ramanujan Sums transform
In this paper, Legendre Ramanujan Sums transform(LRST) is proposed and derived by applying DFT to the complete generalized Legendre sequence (CGLS) matrices. The original matrix based Ramanujan Sums transform (RST) by truncating the Ramanujan Sums series is nonorthogonal and lack of fast algorithm, the proposed LRST has orthogonal property and O(Nlog2N) complexity fast algorithm. The LRST trans...
متن کاملHierarchical Load Balancing for Parallel Fast Legendre Transforms
We present a parallel Fast Legendre Transform (FLT) based on the Driscol{Healy algorithm with computation complexity O(N log 2 N). The parallel FLT is load{ balanced in a hierarchical fashion. We use a load{balanced FFT to deduce a load{ balanced parallel fast cosine transform, which in turn serves as a building block for the Legendre transform engine, from which the parallel FLT is constructed...
متن کاملA fast FFT-based discrete Legendre transform
An O(N(logN)2/ loglogN) algorithm for computing the discrete Legendre transform and its inverse is described. The algorithm combines a recently developed fast transform for converting between Legendre and Chebyshev coefficients with a Taylor series expansion for Chebyshev polynomials about equallyspaced points in the frequency domain. Both components are based on the FFT, and as an intermediate...
متن کاملFast Spherical Harmonic Transform Algorithm based on Generalized Fast Multipole Method
Spherical harmonic transform is the most important orthogonal function transform only except Fourier transform, and is used not only for climate simulation and signal processing but also for a base of several numerical algorithms. Fast Fourier Transform (FFT), which runs in time O(N logN) is quite well known, but, for spherical harmonic transform, there is no fast algorithm which is as simple a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010